Nonconvex `p -regularization and Box Constrained Model for Image Restoration
نویسندگان
چکیده
Abstract. Nonsmooth nonconvex regularization has remarkable advantages for the restoration of piecewise constant images. Constrained optimization can improve the image restoration using a priori information. In this paper, we study regularized nonsmooth nonconvex minimization with box constraints for image restoration. We present a computable positive constant θ for using nonconvex nonsmooth regularization, and show that the difference between each pixel and its four adjacent neighbors is either 0 or larger than θ in the recovered image. Moreover, we give an explicit form of θ for the box constrained image restoration model with the non-Lipschitz nonconvex `p-norm (0 < p < 1) regularization. Our theoretical results show that any local minimizer of this imaging restoration problem is composed of constant regions surrounded by closed contours and edges. Numerical examples are presented to validate the theoretical results and show that the proposed model can recover image restoration results very well.
منابع مشابه
Non-Lipschitz lp-Regularization and Box Constrained Model for Image Restoration
Nonsmooth nonconvex regularization has remarkable advantages for the restoration of piecewise constant images. Constrained optimization can improve the image restoration using a priori information. In this paper, we study regularized nonsmooth nonconvex minimization with box constraints for image restoration. We present a computable positive constant θ for using nonconvex nonsmooth regularizat...
متن کاملSmoothing Quadratic Regularization Methods for Box Constrained Non-lipschitz Optimization in Image Restoration
Abstract. We propose a smoothing quadratic regularization (SQR) method for solving box constrained optimization problems with a non-Lipschitz regularization term that includes the lp norm (0 < p < 1) of the gradient of the underlying image in the l2-lp problem as a special case. At each iteration of the SQR algorithm, a new iterate is generated by solving a strongly convex quadratic problem wit...
متن کاملLinearly Constrained Non-Lipschitz Optimization for Image Restoration
Abstract. Nonsmooth nonconvex optimization models have been widely used in the restoration and reconstruction of real images. In this paper, we consider a linearly constrained optimization problem with a non-Lipschitz regularization term in the objective function which includes the lp norm (0 < p < 1) of the gradient of the underlying image in the l2-lp problem as a special case. We prove that ...
متن کاملNonconvex TVq-Models in Image Restoration: Analysis and a Trust-Region Regularization-Based Superlinearly Convergent Solver
A nonconvex variational model is introduced which contains the `-“norm”, q ∈ (0, 1), of the gradient of the image to be reconstructed as the regularization term together with a leastsquares type data fidelity term which may depend on a possibly spatially dependent weighting parameter. Hence, the regularization term in this functional is a nonconvex compromise between the minimization of the sup...
متن کاملWeighted Schatten $p$-Norm Minimization for Image Denoising with Local and Nonlocal Regularization
This paper presents a patch-wise low-rank based image denoising method with constrained variational model involving local and nonlocal regularization. On one hand, recent patch-wise methods can be represented as a low-rank matrix approximation problem whose convex relaxation usually depends on nuclear norm minimization (NNM). Here, we extend the NNM to the nonconvex schatten p-norm minimization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011